Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions

نویسندگان

  • Michael N. Rice
  • Vassilis J. Tsotras
چکیده

This group has captured the technical details of the paper on “Graph indexing of road networks for shortest path queries with label restrictions” in their review. The reviewers have identified the problem, author is trying to solve in this paper and the challenges involved in it. The reviewers have presented the importance of this problem by some good real life examples related to logistics and travel (some taken from paper and some of reviewers own). The reviewers have missed some points while highlighting contributions in this paper (please see Improvements section). The explanation of the presented concepts such as kleene language and contaction hierarchies are explained well. Also reviewers are successful in explaining the approach with the help of working example. Overall this review is good and captures the essence of the paper but it needs few improvement/modification in writing and analysis of the paper. The specific improvements are listed in next section.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indexing Strategies for Constrained Shortest Paths over Large Social Networks

In this work we introduced the label-constrained shortest path problem as an extension to the shortest path problem that allows a shortest path query to specify which edge labels are allowed on shortest paths. Furthermore we analyse its theoretical difficulty for exact indexing strategies and come to the conclusion that exact indexing is hard for graphs with not trivially small label sets. We t...

متن کامل

Exploring Graph Partitioning for Shortest Path Queries on Road Networks

Computing the shortest path between two locations in a road network is an important problem that has found numerous applications. The classic solution for the problem is Dijkstra’s algorithm [1]. Although simple and elegant, the algorithm has proven to be inefficient for very large road networks. To address this deficiency of Dijkstra’s algorithm, a plethora of techniques that introduce some pr...

متن کامل

Advanced Route Planning in Transportation Networks

Many interesting route planning problems can be solved by computing shortest paths in a suitably modeled, weighted graph representing a transportation network. Such networks are naturally road networks or timetable networks of public transportation. For large networks, the classical Dijkstra algorithm to compute shortest paths is too slow. And therefore have faster algorithms been developed in ...

متن کامل

Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks

In a constrained shortest path (CSP) query, each edge in the road network is associated with both a length and a cost. Given an origin s, a destination t, and a cost constraint θ, the goal is to find the shortest path from s to t whose total cost does not exceed θ. Because exact CSP is NP-hard, previous work mostly focuses on approximate solutions. Even so, existing methods are still prohibitiv...

متن کامل

Efficient Routing in Road Networks with Turn Costs

We present an efficient algorithm for shortest path computation in road networks with turn costs. Each junction is modeled as a node, and each road segment as an edge in a weighted graph. Turn costs are stored in tables that are assigned to nodes. By reusing turn cost tables for identical junctions, we improve the space efficiency. Preprocessing based on an augmented node contraction allows fas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • PVLDB

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2010